Disparity map determination by multiple adaptive windows
نویسندگان
چکیده
The correspondence problem is one of main topics in stereo vision that, despites being studied for many years, is still in progress. In this paper, we present a new method that computes the disparity map. Our method is local (i.e. only information gathered in the close neighborhood is used) and is based on image statistics. More specifically it combines multiple adaptive windows and local statistical measures in order to optimize the quality of the computation of disparity maps. As the size of windows is critical for local methods, we propose an algorithm that modifies the size of windows surrounding the pixel of interest to capture enough information in regions with low texture energy. This process is based on statistical measures (mean and horizontal/vertical average deviation) taken in the windows of the original stereo images. In the last section we show that our method performs very well compared to other existing local methods.
منابع مشابه
Optimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملDisparity Component Matching Revisited
In this paper, we demonstrate how the quality of disparity maps could be improved by applying windows that adapt their shape. In our approach, windows adapt to high-correlation structures in disparity space, which we call the disparity components. The shape of adaptive windows is found by projection the disparity components to the input images, which results in two non-rectangular windows. The ...
متن کاملStable Matching Based on Disparity Components
In this paper, we demonstrate how disparity maps could be improved by applying adaptive windows (varying in their shape). In our approach, windows adapt to high-correlation structures in disparity space, which we call disparity components. The method is straightforward and it is applicable to any stereo algorithm. This helps us in solving standard stereo problems such as: (1) to enforce the int...
متن کاملDisparity map restoration by integration of confidence in Markov random fields models
This paper proposes some Markov Random Field (MRF) models for restoration of stereo disparity maps. The main aspect is the use of confidence maps provided by the Symmetric Multiple Windows (SMW) stereo algorithm to guide the restoration process. The SMW algorithm is an adaptive, multiple-window scheme using left-right consistency to compute disparity and its associated confidence in presence of...
متن کامل3D Plane Labeling Stereo Matching with Content Aware Adaptive Windows
In this paper, we present an algorithm that exploits both the underlying 3D structure and image entropy to generate an adaptive matching window. The presented algorithm estimates real valued disparity maps by smartly exploring a 3D search space using a novel hypothesis generation approach that acts like a propagation scheduler. The proposed approach is among the top performing results when eval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005